Computational complexity of mathematical operations

Results: 76



#Item
51Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1

Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1

Add to Reading List

Source URL: www.tunnuz.net

Language: English - Date: 2014-09-12 00:58:22
52Approximate Clustering of Fingerprint Vectors with Missing Values Andres Figueroa† † Avraham Goldstein‡ Andrzej Lingas?

Approximate Clustering of Fingerprint Vectors with Missing Values Andres Figueroa† † Avraham Goldstein‡ Andrzej Lingas?

Add to Reading List

Source URL: crpit.com

Language: English - Date: 2012-01-19 01:27:42
53An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP Dan Bonachea Computer Science Dept. University of California

An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP Dan Bonachea Computer Science Dept. University of California

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2004-11-10 21:04:25
54Space Dilation in Polynomial-Time Perceptron Algorithms Andriy Kharechko∗† [removed] Abstract This talk surveys applications of space dilation in the perceptron-like algorithms for solving systems of linear inequa

Space Dilation in Polynomial-Time Perceptron Algorithms Andriy Kharechko∗† [removed] Abstract This talk surveys applications of space dilation in the perceptron-like algorithms for solving systems of linear inequa

Add to Reading List

Source URL: eprints.pascal-network.org

Language: English - Date: 2011-11-30 10:22:02
55Arithmetic – Multiplication, DFT, FFT  In this lecture, we study the bit-complexity of various fundamental arithmetic operations for integers and polynomials. This lecture is based upon [2, Chap. 1] . ¶1. Representati

Arithmetic – Multiplication, DFT, FFT In this lecture, we study the bit-complexity of various fundamental arithmetic operations for integers and polynomials. This lecture is based upon [2, Chap. 1] . ¶1. Representati

Add to Reading List

Source URL: www.imsc.res.in

Language: English - Date: 2012-01-30 02:21:41
56Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1

Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1

Add to Reading List

Source URL: tunnuz.net

Language: English - Date: 2014-09-12 00:58:22
57Synthesis and Abstraction of Constraint Models for Hierarchical Resource Allocation Problems Alexander Schiendorfer, Jan-Philipp Stegh¨ofer, and Wolfgang Reif Institute of Software & Systems Engineering, Augsburg Univer

Synthesis and Abstraction of Constraint Models for Hierarchical Resource Allocation Problems Alexander Schiendorfer, Jan-Philipp Stegh¨ofer, and Wolfgang Reif Institute of Software & Systems Engineering, Augsburg Univer

Add to Reading List

Source URL: www.isse.uni-augsburg.de

Language: English - Date: 2014-12-01 09:23:11
58The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed]

The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed]

Add to Reading List

Source URL: www.cs.rit.edu

Language: English - Date: 2003-06-11 09:35:55
59Interior Point Methods twenty years after Florian A. Potra [removed]  Department of Mathematics and Statistics

Interior Point Methods twenty years after Florian A. Potra [removed] Department of Mathematics and Statistics

Add to Reading List

Source URL: www.math.umbc.edu

Language: English - Date: 2003-09-28 23:27:42
60IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 5, MAY[removed]Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 5, MAY[removed]Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2012-05-10 11:53:02